Embedding trees into clique-bridge-clique graphs
نویسندگان
چکیده
منابع مشابه
Path Graphs, Clique Trees, and Flowers
An asteroidal triple is a set of three independent vertices in a graph such that any two vertices in the set are connected by a path which avoids the neighbourhood of the third. A classical result by Lekkerkerker and Boland [10] showed that interval graphs are precisely the chordal graphs that do not have asteroidal triples. Interval graphs are chordal, as are the directed path graphs and the p...
متن کاملOn hereditary clique-Helly self-clique graphs
A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-empty intersection, and it is hereditary clique-Helly (abbreviated HCH) if its induced subgraphs are clique-Helly. The clique graph of a graph G is the intersection graph of its cliques, and G is self-clique if it is connected and isomorphic to its clique graph. We show that every HCH graph is an induced su...
متن کاملSelf-clique Graphs with Prescribed Clique-sizes
The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. A graph G is called self-clique whenever G ∼= K(G). This paper gives various constructions of self-clique graphs. In particular, we employ (r, g)-cages to construct self-clique graphs whose set of clique-sizes is any given finite set of integers greater than 1.
متن کاملClique numbers of graphs
Many graph-theoretical problems involve the study of cliques, i .e ., complete subgraphs (not necessarily maximal) . In this context the following combinatorial problem arises naturally: For which numbers n and c is there a graph with n vertices and exactly c cliques? For fixed n, let G(n) denote the set of all such `clique numbers' c . Since each singleton and the empty set are always cliques,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1979
ISSN: 0528-2195
DOI: 10.21136/cpm.1979.118032